Choosability of P5-Free Graphs
نویسندگان
چکیده
A graph is k-choosable if it admits a proper coloring of its vertices for every assignment of k (possibly different) allowed colors to choose from for each vertex. It is NP-hard to decide whether a given graph is k-choosable for k ≥ 3, and this problem is considered strictly harder than the k-coloring problem. Only few positive results are known on input graphs with a given structure. Here, we prove that the problem is fixed parameter tractable on P5-free graphs when parameterized by k. This graph class contains the well known and widely studied class of cographs. Our result is surprising since the parameterized complexity of k-coloring is still open on P5-free graphs. To give a complete picture, we show that the problem remains NP-hard on P5-free graphs when k is a part of the input.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملTriangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D = Ω( √ n), and at most min ( 2n−Ω( √ n), 2n−D − 2 ) edges.
متن کاملChoosability on H-free graphs
A graph is H-free if it has no induced subgraph isomorphic to H. We determine the computational complexity of the Choosability problem restricted to H-free graphs for every graph H that does not belong to {K1,3, P1 +P2, P1 +P3, P4}. We also show that if H is a linear forest, then the problem is fixed-parameter tractable when parameterized by k.
متن کاملOn (P5, diamond)-free graphs
We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a /nite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacs1 o and Tuza, are (i) combinat...
متن کاملFree Choosability of Outerplanar Graphs
AgraphG is free (a, b)-choosable if for any vertex v with b colors assigned and for any list of colors of size a associated with each vertex u = v, the coloring can be completed by choosing for u a subset of b colors such that adjacent vertices are colored with disjoint color sets. In this note, a necessary and sufficient condition for a cycle to be free (a, b)-choosable is given. As a corollar...
متن کامل